Routing, Resource Allocation and Network Design for Overlay Networks

نویسنده

  • Yong Zhu
چکیده

To my wife Yan, and my parents, for their love, support and encouragement iii ACKNOWLEDGEMENTS My first, and most earnest, acknowledgment must go to my advisor Dr. Mostafa Ammar, who led me into the exciting area of networking and telecommunications. His insights, experience, encouragement, and uncompromising emphasis on quality research guided me through my entire program of study. Much of this thesis work is collaboration with Dr. Constantine Dovrolis. I have learned substantially from his detail-oriented attitude, enthusiasm and dedication to precise and high quality research. I owe a lot to Dr. Admela Jukan for her compassion, dedication, and constant encouragement during my early work in optical networks. This experience provided many important insights and valuable techniques to the thesis work presented here. Dr. Jun Xu offered me opportunities to work on network security projects and I am grateful for his help at different stages of my graduate study. I thank the rest of my thesis committee members: Dr. Ellen Zegura and Dr. Chuanyi Ji for their time and efforts in reviewing this work. Their valuable feedback helped me to improve the dissertation in many ways. I also thank all students and staffs in the Networking and Telecommunications Group, whose friendship and support have turned my journey through graduate school into a pleasure. Finally, I want to thank my parents, without whom none of these would be possible. I am especially indebted to my wonderful wife Yan, who has continually offered love, support, and inspiration. She also provided valuable help with remarkable intelligence in tackling some challenging problems in my thesis work. 7 Time scales for the measurement and dissemination of overlay link-state at the i'th overlay node. M i represents the start of an avail-bw measurement for all the egress overlay links of the i'th overlay node. R i is a link-state refresh event, and it takes place at the end of the last avail-bw measurement. R i,j a represents the arrival of the new link-state from overlay node i to node j. 22 8 A sketch of the native network topology (also showing the location of the overlay nodes).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Decentralized Routing and Power Allocation in FDMA Wireless Networks based on H∞ Fuzzy Control Strategy

Simultaneous routing and resource allocation has been considered in wireless networks for its performance improvement. In this paper we propose a cross-layer optimization framework for worst-case queue length minimization in some type of FDMA based wireless networks, in which the the data routing and the power allocation problem are jointly optimized with Fuzzy distributed H∞ control strategy ....

متن کامل

A heuristic method for consumable resource allocation in multi-class dynamic PERT networks

This investigation presents a heuristic method for consumable resource allocation problem in multi-class dynamic Project Evaluation and Review Technique (PERT) networks, where new projects from different classes (types) arrive to system according to independent Poisson processes with different arrival rates. Each activity of any project is operated at a devoted service station located in a n...

متن کامل

Censorship-Resistant Communication over Public Networks

The rapid growth of peer-to-peer networks and social networking websites has demonstrated the internet’s potential as a medium for grassroots collaboration. This report describes ongoing research into the use of friend-to-friend overlay networks for censorship-resistant communication. Decentralised mechanisms for resource allocation, unforgeable acknowledgements and adaptive routing are propose...

متن کامل

Delay Minimization in Cognitive Mesh Networks using DORP Protocol

Joint design of routing and Resource allocation algorithms in cognitive radio based wireless mesh networks. The mesh nodes utilize cognitive overlay mode to share the spectrum with primary users. Prior to each transmission, mesh nodes sense the wireless medium to identify available spectrum resources. Depending on the primary user activities and traffic characteristics, the available spectrum r...

متن کامل

Delay Minimization in Cognitive Mesh Networks Using Recursive Algorithm in DORP Protocol

Joint design of routing and Resource allocation algorithms in cognitive radio based wireless mesh networks. The mesh nodes utilize cognitive overlay mode to share the spectrum with primary users. Prior to each transmission, mesh nodes sense the wireless medium to identify available spectrum resources. Depending on the primary user activities and traffic characteristics, the available spectrum r...

متن کامل

طراحی لایه- متقاطع برای کنترل ازدحام، مسیریابی و زمان‌بندی در شبکه‌های بی‌سیم ad-hocبا در نظر‌گرفتن توان الکتریکی گره‌ها

Abstract Ad hoc Wireless Networks, are networks formed by a collection of nodes through radio. In wireless networking environment, formidable challenges are presented. One important challenge is connection maintenance mechanism for power consumption. In this paper, a multi-objective optimal design is considered for ad-hoc networks which address the electrical power of nodes effects on cross-l...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006